GREEN FUNCTIONS AND NONLINEAR SYSTEMS: SHORT TIME EXPANSION
نویسندگان
چکیده
منابع مشابه
Finite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملEnergy Functions and Balancing for Nonlinear Discrete-time Systems
This paper presents the nonlinear discrete-time versions of the controllabilit y and observabilit y functions, its properties and algorithms to nd them. F urthermore, since the resulting energy functions are con tinuousfunctions of the initial state, nonlinear balancing techniques can be directly used. Linear and nonlinear examples are presented to illustrate these algorithms. Copyright 2001 c ...
متن کاملShort-time existence theory toward stability for nonlinear parabolic systems
We establish existence of classical solutions for nonlinear parabolic systems in divergence form on Rn, under mild regularity assumptions on coefficients in the problem, and under the assumption of Hölder continuous initial conditions. Our analysis is motivated by the study of stability for stationary and traveling wave solutions arising in such systems. In this setting, large-time bounds obtai...
متن کاملNonlinear Memory Functions for Modeling Discrete Time Systems
Certain computational structures consisting of linear temporal encoding stages followed by feed-forward neural networks have previously been shown to be universal approximators of causal, time-invariant discrete time systems. Such structures can approximate arbitrarily well almost any causal time-invariant discrete time system provided the size of the temporal encoding stage is allowed to be ar...
متن کاملExpansion and estimation of the range of nonlinear functions
Many verification algorithms use an expansion f(x) ∈ f(x̃) + S · (x−x̃), f : Rn → Rn for x ∈ X, where the set of matrices S is usually computed as a gradient or by means of slopes. In the following, an expansion scheme is described which frequently yields sharper inclusions for S. This allows also to compute sharper inclusions for the range of f over a domain. Roughly speaking, f has to be given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics A
سال: 2008
ISSN: 0217-751X,1793-656X
DOI: 10.1142/s0217751x08038160